Factorial Theorem and Factorial for Positive Real Number

Frucht's theorem for the digraph factorial

To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G. A new operation on digraphs was introduced recently as an aid in solving certain questions regarding cancellation over the direct product of digraphs. Given a digraph A, its factoria...

Factorial Design

Factorial Anova

But these experiments [2] will not give us any information about the dependence or independence of the two factors, namely study habit and home environment. In such cases, we resort to Factorial ANOVA which not only helps us to study the effect of two or more factors but also gives information about their dependence or independence in the same experiment. There are many types of factorial desig...

Factorial Anova

But these experiments [2] will not give us any information about the dependence or independence of the two factors, namely study habit and home environment. In such cases, we resort to Factorial ANOVA which not only helps us to study the effect of two or more factors but also gives information about their dependence or independence in the same experiment. There are many types of factorial desig...

Generalized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs

Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...